Modeling Dynamic User Preference via Dictionary Learning for Sequential Recommendation

نویسندگان

چکیده

Capturing the dynamics in user preference is crucial to better predict future behaviors because preferences often drift over time. Many existing recommendation algorithms -- including both shallow and deep ones model such independently, i.e., static dynamic are not modeled under same latent space, which makes it difficult fuse them for recommendation. This paper considers problem of embedding a user's sequential behavior into space preferences, namely translating sequence preference. To this end, we formulate task as dictionary learning problem, learns: 1) shared matrix, each row represents partial signal across users; 2) posterior distribution estimator using autoregressive integrated with Gated Recurrent Unit (GRU), can select related rows represent conditioned on his/her past behaviors. Qualitative studies Netflix dataset demonstrate that proposed method capture drifts time quantitative multiple real-world datasets achieve higher accuracy compared state-of-the-art factorization neural methods. The code available at https://github.com/cchao0116/S2PNM-TKDE2021.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Social recommendation via multi-view user preference learning

Recommender system (RS) has become an active research area driven by the enormous industrial demands. Meanwhile, with the rapid development of microblogging system, various kinds of social data are available, which provide opportunities as well as challenges for traditional RSs. In this paper, we introduce the social recommendation (SR) problem utilizing microblogging data. We study this proble...

متن کامل

Modeling Users' Dynamic Preference for Personalized Recommendation

Modeling the evolution of users’ preference over time is essential for personalized recommendation. Traditional time-aware models like (1) timewindow or recency based approaches ignore or deemphasize much potentially useful information, and (2) time-aware collaborative filtering (CF) approaches largely rely on the information of other users, thus failing to precisely and comprehensively profile...

متن کامل

User Preference Through Learning User Profile for Ubiquitous Recommendation Systems

As ubiquitous commerce is coming, the ubiquitous recommendation systems utilize collaborative filtering to help users with fast searches for the best suitable items by analyzing the similar preference. However, collaborative filtering may not provide high quality recommendation because it does not consider user’s preference on the attribute, the first rater problem, and the sparsity problem. Th...

متن کامل

Learning User Preference Models under Uncertainty for Personalized Recommendation

Preference modeling has a crucial role in customer relationship management systems. Traditional approaches to preference modeling are based on decision and utility theory by explicitly querying users about the behavior of value function, or utility of every outcome with regard to each decision criterion. They are error-prone and labor intensive. To address these limitations, computer based impl...

متن کامل

User Preference Learning with Multiple Information Fusion for Restaurant Recommendation

If properly analyzed, the multi-aspect rating data could be a source of rich intelligence for providing personalized restaurant recommendations. Indeed, while recommender systems have been studied for various applications and many recommendation techniques have been developed for general or specific recommendation tasks, there are few studies for restaurant recommendation by addressing the uniq...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering

سال: 2022

ISSN: ['1558-2191', '1041-4347', '2326-3865']

DOI: https://doi.org/10.1109/tkde.2021.3050407